Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("ALPHABET")

Filter

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Origin

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 2509

  • Page / 101
Export

Selection :

  • and

NOUVEAUX CARACTERES.1976; CARACTERE; FR.; DA. 1976; VOL. 27; NO 8-9; PP. 50-53Article

ENTROPY IN ALPHABETIZATION OF WORDS IN VARIOUS LANGUAGESKODMAN F.1982; PSYCHOL. REP.; ISSN 0033-2941; USA; DA. 1982; VOL. 50; NO 3; PART. 1; PP. 703-706; BIBL. 13 REF.Article

THE EQUIVALENCE PROBLEM FOR DOL SYSTEMS AND ITS DECIDABILITY FOR BINARY ALPHABETS.VALIANT LG.1976; IN: AUTOM. LANG. PROGRAM. INT. COLLOQ. 3; EDINBURGH; 1976; EDINBURGH; UNIV. PRESS; DA. 1976; PP. 31-37; BIBL. 8 REF.Conference Paper

PERIODICITY AND UNBORDERED SEGMENTS OF WORDSEHRENFEUCHT A; SILBERGER DM.1979; DISCRETE MATH.; NLD; DA. 1979; VOL. 26; NO 2; PP. 101-109; BIBL. 2 REF.Article

INFINITARY RELATIONSNIVAT MAURICE.1981; ; FRA; DA. 1981; INRIA/54; 28 P.; 30 CM; ABS. FRE; BIBL. 7 REF.; RAPPORTS DE RECHERCHE; 54Report

ON STRONGLY CUBE-FREE CO-WORDS GENERATED BY BINARY MORPHISMSKARHUMAKI J.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 117; PP. 182-189; BIBL. 6 REF.Conference Paper

WORD RECOGNITION IN SERBO-CROATIAN IS PHONOLOGICALLY ANALYTICFELDMAN LB; TURVEY MT.1983; JOURNAL OF EXPERIMENTAL PSYCHOLOGY: HUMAN PERCEPTION AND PERFORMANCE; ISSN 0096-1523; USA; DA. 1983; VOL. 9; NO 2; PP. 288-298; BIBL. 19 REF.Article

THE SHORTEST COMMON SUPERSEQUENCE PROBLEM OVER BINARY ALPHABET IS NP-COMPLETEKARI JOUKO RAIHA; UKKONEN E.1981; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1981; VOL. 16; NO 2; PP. 187-198; BIBL. 7 REF.Article

ONE COUNTER LANGUAGES AND THE CHEVRON OPERATIONGREIBACH SA.1979; R.A.I.R.O., INFORMAT. THEOR.; FRA; DA. 1979; VOL. 13; NO 2; PP. 189-194; ABS. FRE; BIBL. 12 REF.Article

P-SELECTIVE SETS, TALLY LANGUAGES, AND THE BEHAVIOR OF POLYNOMIAL TIME REDUCIBILITIES ON NPSELMAN AL.1979; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1979; NO 71; PP. 546-555; BIBL. 15 REF.Conference Paper

STAR-FREE REGULAR SETS OF OMEGA -SEQUENCESTHOMAS W.1979; INFIRM. AND CONTROL; USA; DA. 1979; VOL. 42; NO 2; PP. 148-156; BIBL. 10 REF.Article

SUBSTITUTIONS DANS LES EDTOL SYSTEMES ULTRALINEAIRESLATTEUX M.1979; INFIRM. AND CONTROL; USA; DA. 1979; VOL. 42; NO 2; PP. 194-260; ABS. ENG; BIBL. 26 REF.Article

ETUDE ALGEBRIQUE DES CODES LES PLUS SIMPLES ET DES EQUATIONS DE MOTS SANS COEFFICIENTSKISELEVA LG.1979; MAT. SBOR.; SUN; DA. 1979; VOL. 108; NO 4; PP. 529-550; BIBL. 10 REF.Article

SHARP CHARACTERISATIONS OF SQUAREFREE MORPHISMSCROCHEMORE M.1982; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1982; VOL. 18; NO 2; PP. 221-226; BIBL. 8 REF.Article

REFLECTIVE STAR LANGUAGES AND CODESREIS CM; THIERRIN G.1979; INFORM. AND CONTROL; USA; DA. 1979; VOL. 42; NO 1; PP. 1-9; BIBL. 7 REF.Article

ESTIMATIONS DE LA COMPLEXITE DES ALGORITHMES NORMAUXSHURYGIN VA.1979; DOKL. AKAD. NAUK S.S.S.R.; SUN; DA. 1979; VOL. 244; NO 5; PP. 1097-1101; BIBL. 2 REF.Article

PROJEKT BRAJLOWSKIEJ NOTACJI INFORMATYCZNEJ = CONCEPTION D'UNE NOTATION INFORMATIQUE DU BRAILLESAWA R.1978; PRACE I.P.I. P.A.N.; POL; DA. 1978; NO 342; 16 P.; ABS. ENG/RUS; BIBL. 11 REF.Serial Issue

CHOIX DU CODE PRIMAIRE DANS LES SYSTEMES DE TRANSMISSION DE DONNEESOSIPOV VG; SHVARTSMAN VO.1977; ELEKTROSVJAZ; S.S.S.R.; DA. 1977; NO 8; PP. 17-20; BIBL. 4 REF.Article

VARIAZIONI DELL' ENTROPIA LINGUISTICA DELL' ITALIANO SCRITTO E CALCOLO DI UN' ENTROPIA FONEMATICA = VARIATIONS DE L'ENTROPIE LINGUISTIQUE DE L'ITALIEN ECRIT ET CALCUL D'UNE ENTROPIE PHONEMATIQUEMINNAJA C; PACCAGNELLA L.1977; R.C. SEMINAR. MAT. UNIV. PADOVA; ITA; DA. 1977; VOL. 57; PP. 247-265; BIBL. 8 REF.Article

SYSTEMES DYNAMIQUES TOPOLOGIQUES ASSOCIES A DES AUTOMATES RECURRENTSBLANCHARD F.1981; Z. WAHRSCHEINLICHKEITSTHEOR. VERW. GEB.; ISSN 0044-3719; DEU; DA. 1981; VOL. 58; NO 4; PP. 549-564; BIBL. 10 REF.Article

LOWER BOUNDS ON SPACE COMPLEXITY FOR CONTEXT FREE RECOGNITIONALT H.1979; ACTA INFORMAT.; DEU; DA. 1979; VOL. 12; NO 1; PP. 33-61; BIBL. 17 REF.Article

OPERATIONS DE CYLINDRE ET APPLICATIONS SEQUENTIELLES GAUCHES INVERSESAUTEBERT JM.1979; ACTA INFORMAT.; DEU; DA. 1979; VOL. 11; NO 3; PP. 241-258; ABS. ENG; BIBL. 17 REF.Article

ALPHABETIC NOTATION BIAS IN BLIND TEST RESEARCHDEAN ML.1982; J. PSYCHOL.; ISSN 0022-3980; USA; DA. 1982; VOL. 111; PP. 269-271; BIBL. 4 REF.Article

EXPANDED SUBALPHABETS IN THE THEORIES OF LANGUAGES AND SEMIGROUPSHEAD T.1982; INT. J. COMPUT. METH.; ISSN 0020-7160; GBR; DA. 1982; VOL. 12; NO 2; PP. 113-123; BIBL. 11 REF.Article

APPLICATION DE LA THEORIE DU CODAGE A L'ECRITURE ARABE.MANSOUR MR.1976; ; S.L.; DA. 1976; PP. 1-93; H.T. 21; BIBL. 1 P. 1/2; (THESE DOCT. SPEC. MATH., MATH. APPL., 3E CYCLE; CLAUDE BERNARD-LYON)Thesis

  • Page / 101